Auslander-Yorke type dichotomy theorems for stronger versions of $r$-sensitivity

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stronger Lasota-yorke Inequality for One-dimensional Piecewise Expanding Transformations

For a large class of piecewise expanding C1,1 maps of the interval we prove the Lasota-Yorke inequality with a constant smaller than the previously known 2/ inf |τ ′|. Consequently, the stability results of Keller-Liverani [7] apply to this class and in particular to maps with periodic turning points. One of the applications is the stability of acim’s for a class of W-shaped maps. Another appli...

متن کامل

The Dichotomy Theorems

1. The G0 dichotomy A digraph (or directed graph) on a set X is a subset G ⊆ X \ ∆. Given a digraph G on a set X and a subset A ⊆ X, we say that A is G-discrete if for all x, y ∈ A we have (x, y) / ∈ G. Now let sn ∈ 2 be chosen for every n ∈ N such that ∀s ∈ 2<N ∃n s v sn. Then we can define a digraph G0 on 2N by G0 = {(sn0x, sn1x) ∈ 2N × 2N ∣∣ n ∈ N & x ∈ 2N}. Lemma 1. If B ⊆ 2N has the Baire ...

متن کامل

On stronger versions of Brumer’s conjecture

Let k be a totally real number field and L a CM-field such that L/k is finite and abelian. In this paper, we study a stronger version of Brumer’s conjecture that the Stickelberger element times the annihilator of the group of roots of unity in L is in the Fitting ideal of the ideal class group of L, and also study the dual version. We mainly study the Teichmüller character component, and determ...

متن کامل

Some Dichotomy Theorems for Neural Learning Problems

The computational complexity of learning from binary examples is investigated for linear threshold neurons. We introduce combinatorial measures that create classes of infinitely many learning problems with sample restrictions. We analyze how the complexity of these problems depends on the values for the measures. The results are established as dichotomy theorems showing that each problem is eit...

متن کامل

Auslander-type Conditions

Throughout this article, Λ is a left and right Noetherian ring (unless stated otherwise), modΛ is the category of finitely generated left Λ-modules and 0 → Λ → I0(Λ) → I1(Λ) → · · · → Ii(Λ) → · · · is the minimal injective resolution of Λ as a left Λ-module. For a module M ∈ mod Λ and a non-negative integer n, recall that the grade of M , denoted by gradeM , is said to be at least n if ExtΛ(M, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2019

ISSN: 0002-9939,1088-6826

DOI: 10.1090/proc/14435